Efficient evaluation of triangular B-spline surfaces

Multiresolution Triangular B-Spline Surfaces

We present multiresolution B-spline surfaces of arbitrary order defined over triangular domains. Unlike existing methods, the basic idea of our approach is to construct the triangular basis functions from their tensor product relatives in the spirit of box splines by projecting them onto the barycentric plane. The scheme works for splines of any order where the fundamental building blocks of th...

Algorithms for B - patches

B-patches are the analogue to B-spline segments for triangular surfaces and are the main building block in the new multivariate B-spline surfaces recently developed in [8). This paper discusses algorithms for B-patches and presents algorithms for computing the polar form, for evaluation, for differentiation, for computing continuous joints, and for knot insertion .

Evaluating Tensor Product and Triangular B ezier Surfaces

Many papers describe techniques for evaluating spline curves and surfaces. While each paper provides some theoretical or empirical evidence with which to compare techniques, there exist few global comparisons Peters94]. Also, papers describing particular algorithms often provide few details, making implementation of the technique presented diicult or impossible. This report attempts to illumina...

Efficient Evaluation of Triangular B-splines

Compression of parametric surfaces for efficient 3D model coding

In the field of compression, the type of 3D models traditionally considered is that of polygonal meshes, for which several efficient compression techniques have been proposed in the recent years. Nowadays, an increasing proportion of 3D models are created by a synthesis or modeling process, instead of captured from the real world. Such models are most often given as parametric surfaces, which h...